GPU-accelerated Exhaustive Verification of the Collatz Conjecture
نویسندگان
چکیده
منابع مشابه
GPU-accelerated Exhaustive Verification of the Collatz Conjecture
The main contribution of this paper is to present an implementation that performs the exhaustive search to verify the Collatz conjecture using a GPU. Consider the following operation on an arbitrary positive number: if the number is even, divide it by two, and if the number is odd, triple it and add one. The Collatz conjecture asserts that, starting from any positive number m, repeated iteratio...
متن کاملGPU-Accelerated Verification of the Collatz Conjecture
The main contribution of this paper is to present an implementation that performs the exhaustive search to verify the Collatz conjecture using a GPU. Consider the following operation on an arbitrary positive number: if the number is even, divide it by two, and if the number is odd, triple it and add one. The Collatz conjecture asserts that, starting from any positive number m, repeated iteratio...
متن کاملCollatz Conjecture
My math 301 Term paper will be concerned with exploring the Collatz conjecture. I will discuss the importance and interest of this conjecture; what progress has been made on this problem and who made it. I will also explore whether any connections have been made between the Collatz conjecture and other mathematical problems.
متن کاملA New Proof of the Collatz Conjecture
This paper is a revised version of a previous paper by the author that, after publication, was found to contain an error. This paper supersedes and replaces the previous paper. A modified form of the Collatz transformation is formulated, leading to the concept of a modified Collatz chain. A smallest counterexample N0 to the Collatz Conjecture is hypothesized ; the existence of N0 implies that N...
متن کاملThe Collatz 3n+1 Conjecture Is Unprovable
In this paper, we show that any proof of the Collatz 3n + 1 Conjecture must have an infinite number of lines. Therefore, no formal proof is possible. We also discuss whether the proof strategy in this paper has any promise for proving that the Riemann Hypothesis is also unprovable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networking and Computing
سال: 2017
ISSN: 2185-2839,2185-2847
DOI: 10.15803/ijnc.7.1_69